A Quadratic Bound for the Determinant and Permanent Problem
نویسندگان
چکیده
The size of an arithmetical formula is the number of symbols (+,×) which it contains. The complexity of a polynomial defined over a field k is the minimum size of formulas defining it (see [10]). Using this notion of complexity, Valiant gave algebraic analogs to algorithmic complexity problems such as P = NP (see [10, 11, 12]). In this context, we would like to find lower bounds to the complexity of certain sequences of polynomials. Such a sequence is given by the permanent Permn of a matrix M = (mi,j) of size n× n:
منابع مشابه
A quadratic lower bound for the permanent and determinant problem
In Valiant’s theory of arithmetic complexity, the classes VP and VNP are analogs of P and NP. A fundamental problem concerning these classes is the Permanent and Determinant Problem: Given a field F of characteristic 6= 2, and an integer n, what is the minimum m such that the permanent of an n × n matrix X = (xij) can be expressed as a determinant of an m × m matrix, where the entries of the de...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملSolving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004